The Pseudovariety J is Hyperdecidable
نویسندگان
چکیده
— This article defines the notion of hyperdecidability for a class offinlte semigroups, which is closely connected to the notion of decidability. It then proves that the pseudovariety J of J-trivial semigroups is hyperdecidable.
منابع مشابه
Hyperdecidable Pseudovarieties and the Calculation of Semidirect Products
This note introduces the notion of a hyperdecidable pseudovariety. This notion appears naturally in trying to prove decidability of the membership problem of semidirect products of pseudovarieties of semigroups. It turns out to be a generalization of a notion introduced by C. J. Ash in connection with his proof of the \type II" theorem. The main results in this paper include a formulation of th...
متن کاملSC-hyperdecidability of R
A class TC(X) of X-graphs is introduced, and an algorithmic property of labellings of nite strongly connected graphs by rational languages is shown to be decidable. This property, named as TC-inevitability, is a language-theoretic analogue of the R-inevitability of labellings of nite strongly connected graphs by nite monoids. As a consequence, the pseudovariety R of all nite R-trivial monoids i...
متن کاملTameness of pseudovariety joins involving R 1
In this paper, we establish several decidability results for pseudovariety joins of the form V ∨ W, where V is a subpseudovariety of J or the pseudovariety R. Here, J (resp. R) denotes the pseudovariety of all J-trivial (resp. R-trivial) semigroups. In particular, we show that the pseudovariety V ∨ W is (completely) κ-tame when V is a subpseudovariety of J with decidable κ-word problem and W is...
متن کاملPseudovariety joins involving J -trivial semigroups and completely regular semigroups
J. Rhodes asked during the Chico conference in 1986 for the calculation of joins of semigroup pseudovarieties. This paper proves that the join J∨V of the pseudovariety J of J -trivial semigroups and of any 2-strongly decidable pseudovariety V of completely regular semigroups is decidable. This problem was proposed by the first author for V = G, the pseudovariety of finite groups.
متن کاملTameness of pseudovariety joins
The concept of tameness of a pseudovariety was introduced by Almeida and Steinberg [1] as a tool for proving decidability of the membership problem for semidirect products of pseudovarieties. Recall that the join V ∨ W of two pseudovarieties V and W is the least pseudovariety containing both V and W. This talk is concerned with the problem of proving tameness of joins. This problem was consider...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 31 شماره
صفحات -
تاریخ انتشار 1997